<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>SYMMETRY: tree::cBinaryRep&lt; T &gt; Class Template Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">SYMMETRY
   </div>
   <div id="projectbrief">C++LIBRARYFORSCIENTIFICCOMPUTATION</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="classes.html"><span>Class&#160;Index</span></a></li>
      <li><a href="inherits.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('classtree_1_1cBinaryRep.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Pages</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="summary">
<a href="#pub-types">Public Types</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pro-methods">Protected Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="classtree_1_1cBinaryRep-members.html">List of all members</a>  </div>
  <div class="headertitle">
<div class="title">tree::cBinaryRep&lt; T &gt; Class Template Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p><code>#include &lt;<a class="el" href="binary__rep_8h_source.html">binary_rep.h</a>&gt;</code></p>
<div class="dynheader">
Collaboration diagram for tree::cBinaryRep&lt; T &gt;:</div>
<div class="dyncontent">
<div class="center"><img src="classtree_1_1cBinaryRep__coll__graph.png" border="0" usemap="#tree_1_1cBinaryRep_3_01T_01_4_coll__map" alt="Collaboration graph"/></div>
<map name="tree_1_1cBinaryRep_3_01T_01_4_coll__map" id="tree_1_1cBinaryRep_3_01T_01_4_coll__map">
<area shape="rect" id="node2" href="structtree_1_1btree__node.html" title="{tree::btree_node\&lt; T \&gt;\n||+ btree_node()\l+ btree_node()\l}" alt="" coords="5,147,163,239"/></map>
</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:a4218118406b4b792f771f2cffab1fe67"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a4218118406b4b792f771f2cffab1fe67"></a>
typedef <a class="el" href="structtree_1_1btree__node.html">btree_node</a>&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>node_type</b></td></tr>
<tr class="separator:a4218118406b4b792f771f2cffab1fe67"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af8646ca9dd6c8e2abc30f0a24eea2785"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="af8646ca9dd6c8e2abc30f0a24eea2785"></a>
typedef <a class="el" href="classtree_1_1btree__iterator.html">btree_iterator</a>&lt; T, <br class="typebreak"/>
<a class="el" href="structtree_1_1btree__node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>iterator</b></td></tr>
<tr class="separator:af8646ca9dd6c8e2abc30f0a24eea2785"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a80d54fe0461119770e3be144672dcbc6"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a80d54fe0461119770e3be144672dcbc6"></a>
typedef <br class="typebreak"/>
<a class="el" href="classtree_1_1btree__preorder__iterator.html">btree_preorder_iterator</a>&lt; T, <br class="typebreak"/>
<a class="el" href="structtree_1_1btree__node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>preorder_iterator</b></td></tr>
<tr class="separator:a80d54fe0461119770e3be144672dcbc6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad1bba7a7672ee7bdf7ef4979a1b00879"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ad1bba7a7672ee7bdf7ef4979a1b00879"></a>
typedef <a class="el" href="classtree_1_1btree__inorder__iterator.html">btree_inorder_iterator</a><br class="typebreak"/>
&lt; T, <a class="el" href="structtree_1_1btree__node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>inorder_iterator</b></td></tr>
<tr class="separator:ad1bba7a7672ee7bdf7ef4979a1b00879"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7bef52fb6be8078a9d082c22f9054dd0"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a7bef52fb6be8078a9d082c22f9054dd0"></a>
typedef <br class="typebreak"/>
<a class="el" href="classtree_1_1btree__postorder__iterator.html">btree_postorder_iterator</a>&lt; T, <br class="typebreak"/>
<a class="el" href="structtree_1_1btree__node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>postorder_iterator</b></td></tr>
<tr class="separator:a7bef52fb6be8078a9d082c22f9054dd0"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a7a8f861470cb8538aa03ddbb9cbac6af"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1cBinaryRep.html#a7a8f861470cb8538aa03ddbb9cbac6af">operator==</a> (const <a class="el" href="classtree_1_1cBinaryRep.html">cBinaryRep</a> &amp;bin_rep)</td></tr>
<tr class="separator:a7a8f861470cb8538aa03ddbb9cbac6af"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5701848a04cd825236bc125b33e376d8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classtree_1_1btree__inorder__iterator.html">inorder_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1cBinaryRep.html#a5701848a04cd825236bc125b33e376d8">begin_inorder</a> ()</td></tr>
<tr class="separator:a5701848a04cd825236bc125b33e376d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6e912be346d3626156df92eabecee012"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classtree_1_1btree__preorder__iterator.html">preorder_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1cBinaryRep.html#a6e912be346d3626156df92eabecee012">begin_preorder</a> ()</td></tr>
<tr class="separator:a6e912be346d3626156df92eabecee012"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a99f4029023bc6b07fade450aceb2f17d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classtree_1_1btree__postorder__iterator.html">postorder_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1cBinaryRep.html#a99f4029023bc6b07fade450aceb2f17d">begin_postorder</a> ()</td></tr>
<tr class="separator:a99f4029023bc6b07fade450aceb2f17d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acf645e7e2447eb801c71ac752ecede22"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classtree_1_1btree__preorder__iterator.html">preorder_iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1cBinaryRep.html#acf645e7e2447eb801c71ac752ecede22">end</a> ()</td></tr>
<tr class="separator:acf645e7e2447eb801c71ac752ecede22"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1bd7a582b25b1f7a4ff76ea936377458"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classtree_1_1btree__iterator.html">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1cBinaryRep.html#a1bd7a582b25b1f7a4ff76ea936377458">insertLeftChild</a> (<a class="el" href="classtree_1_1btree__iterator.html">iterator</a> iter, const T &amp;data)</td></tr>
<tr class="separator:a1bd7a582b25b1f7a4ff76ea936377458"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a593596cea8e60e85a0f66fb3354617a8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classtree_1_1btree__iterator.html">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1cBinaryRep.html#a593596cea8e60e85a0f66fb3354617a8">insertRightChild</a> (<a class="el" href="classtree_1_1btree__iterator.html">iterator</a> iter, const T &amp;data)</td></tr>
<tr class="separator:a593596cea8e60e85a0f66fb3354617a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aae971b4e02baaa0c4d51ce1416ca2178"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="aae971b4e02baaa0c4d51ce1416ca2178"></a>
<a class="el" href="classtree_1_1btree__iterator.html">iterator</a>&#160;</td><td class="memItemRight" valign="bottom"><b>insertRoot</b> (const T &amp;data)</td></tr>
<tr class="separator:aae971b4e02baaa0c4d51ce1416ca2178"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aebf973eb7334a5cf2134a51ebc519d33"><td class="memTemplParams" colspan="2">template&lt;typename FUNC &gt; </td></tr>
<tr class="memitem:aebf973eb7334a5cf2134a51ebc519d33"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree_1_1cBinaryRep.html#aebf973eb7334a5cf2134a51ebc519d33">traverse</a> (tree_traversal traversal, FUNC &amp;visit)</td></tr>
<tr class="separator:aebf973eb7334a5cf2134a51ebc519d33"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:a2b7e8d490a1e5f4b5c58fb58e29330ef"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a2b7e8d490a1e5f4b5c58fb58e29330ef"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>cBinaryRep</b> (const <a class="el" href="classtree_1_1cBinaryRep.html">cBinaryRep</a> &amp;bin_rep)</td></tr>
<tr class="separator:a2b7e8d490a1e5f4b5c58fb58e29330ef"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4c6eb53e4805dcb0ac0032289bb7d0d8"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a4c6eb53e4805dcb0ac0032289bb7d0d8"></a>
<a class="el" href="classtree_1_1cBinaryRep.html">cBinaryRep</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>operator=</b> (const <a class="el" href="classtree_1_1cBinaryRep.html">cBinaryRep</a> &amp;bin_rep)</td></tr>
<tr class="separator:a4c6eb53e4805dcb0ac0032289bb7d0d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:acc04e77d74d4c7be7aceb048d512965a"><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="acc04e77d74d4c7be7aceb048d512965a"></a>
<a class="el" href="structtree_1_1btree__node.html">node_type</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>m_Root</b></td></tr>
<tr class="separator:acc04e77d74d4c7be7aceb048d512965a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><h3>template&lt;typename T&gt;<br/>
class tree::cBinaryRep&lt; T &gt;</h3>

<p>binary tree usual representation(left node pointing to the left subtree, right node pointing to the right subtree) </p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a class="anchor" id="a5701848a04cd825236bc125b33e376d8"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classtree_1_1btree__inorder__iterator.html">inorder_iterator</a> <a class="el" href="classtree_1_1cBinaryRep.html">tree::cBinaryRep</a>&lt; T &gt;::begin_inorder </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>returns an iterator to the beginning of the tree for inorder traversal </p>

</div>
</div>
<a class="anchor" id="a99f4029023bc6b07fade450aceb2f17d"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classtree_1_1btree__postorder__iterator.html">postorder_iterator</a> <a class="el" href="classtree_1_1cBinaryRep.html">tree::cBinaryRep</a>&lt; T &gt;::begin_postorder </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>returns an iterator to the beginning of the tree for postorder traversal </p>

</div>
</div>
<a class="anchor" id="a6e912be346d3626156df92eabecee012"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classtree_1_1btree__preorder__iterator.html">preorder_iterator</a> <a class="el" href="classtree_1_1cBinaryRep.html">tree::cBinaryRep</a>&lt; T &gt;::begin_preorder </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>returns an iterator to the beginning of the tree for preorder traversal </p>

</div>
</div>
<a class="anchor" id="acf645e7e2447eb801c71ac752ecede22"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classtree_1_1btree__preorder__iterator.html">preorder_iterator</a> <a class="el" href="classtree_1_1cBinaryRep.html">tree::cBinaryRep</a>&lt; T &gt;::end </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>returns an empty iterator signifying the end of the tree ! used in constructs like for(iterator it = tree.begin(); it != tree.end(); it++) </p>

</div>
</div>
<a class="anchor" id="a1bd7a582b25b1f7a4ff76ea936377458"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classtree_1_1btree__iterator.html">iterator</a> <a class="el" href="classtree_1_1cBinaryRep.html">tree::cBinaryRep</a>&lt; T &gt;::insertLeftChild </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classtree_1_1btree__iterator.html">iterator</a>&#160;</td>
          <td class="paramname"><em>iter</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>data</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>inserts data as a left child of the node indicated by the iterator </p>

</div>
</div>
<a class="anchor" id="a593596cea8e60e85a0f66fb3354617a8"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classtree_1_1btree__iterator.html">iterator</a> <a class="el" href="classtree_1_1cBinaryRep.html">tree::cBinaryRep</a>&lt; T &gt;::insertRightChild </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classtree_1_1btree__iterator.html">iterator</a>&#160;</td>
          <td class="paramname"><em>iter</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>data</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>inserts data as a right child of the node indicated by the iterator </p>

</div>
</div>
<a class="anchor" id="a7a8f861470cb8538aa03ddbb9cbac6af"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="classtree_1_1cBinaryRep.html">tree::cBinaryRep</a>&lt; T &gt;::operator== </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="classtree_1_1cBinaryRep.html">cBinaryRep</a>&lt; T &gt; &amp;&#160;</td>
          <td class="paramname"><em>bin_rep</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>checks for equality &ndash; !compares the data in every node of the tree for equality </p>

</div>
</div>
<a class="anchor" id="aebf973eb7334a5cf2134a51ebc519d33"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<div class="memtemplate">
template&lt;typename FUNC &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classtree_1_1cBinaryRep.html">tree::cBinaryRep</a>&lt; T &gt;::traverse </td>
          <td>(</td>
          <td class="paramtype">tree_traversal&#160;</td>
          <td class="paramname"><em>traversal</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">FUNC &amp;&#160;</td>
          <td class="paramname"><em>visit</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>traverse the binary tree in the given tree_traversal order takes a function object as a parameter, which must implement operator(T) </p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>tree/<a class="el" href="binary__rep_8h_source.html">binary_rep.h</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><b>tree</b></li><li class="navelem"><a class="el" href="classtree_1_1cBinaryRep.html">cBinaryRep</a></li>
    <li class="footer">Generated on Tue Feb 25 2014 17:11:52 for SYMMETRY by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
